Search for: All records

This article deals with reliable and unreliable mobile sensors having identical sensing radiusr, communication radiusR, provided thatr≤Rand initially randomly deployedon the planeby dropping them from an aircraft according to general random process. The sensors have to move from their initial random positions to the final destinations to provide greedy pathk₁-coverage simultaneously withk₂-connectivity. In particular, we are interested in assigning the sensing radiusrand communication radiusRto minimizethe time requiredandthe energy consumptionof transportation cost for sensors to provide the desiredk₁-coverage withk₂-connectivity. We prove that for both of these optimization problems, the optimal solution is to assign the sensing radius equal tor=k₁||E[S]||/2 and the communication radiusR=k₂||E[S]||/2, where ||E[S]|| is the characteristic of general random process according to which the sensors are deployed. Whenr<k₁||E[S]||/2 orR<k₂||E[S]||/ 2, and sensors are reliable, we discover and explainthe sharp increasein the time required and the energy consumption in transportation cost to ensure the desiredk₁-coverage withk₂-connectivity.